Ten „zły” Berman? Słowo o książce Piotra Rypsona [dot. P. Rypson: Czerwony monter. Mieczysław Berman: grafik, który zaprojektował polski komunizm]
نویسندگان
چکیده
منابع مشابه
Scaled Dimension and the Berman-Hartmanis Conjecture
In 1977, L. Berman and J. Hartmanis [BH77] conjectured that all polynomialtime many-one complete sets for NP are are pairwise polynomially isomorphic. It was stated as an open problem in [LM99] to resolve this conjecture under the measure hypothesis from quantitative complexity theory. In this paper we study the polynomial-time isomorphism degrees within degm(SAT ) in the context of polynomial ...
متن کاملO'Donoghue Recognized with Loevinger-Berman Award.
A t the SNMMI Annual Meeting on June 14th in San Diego, CA, Joseph A. O’Donoghue, PhD, of Memorial Sloan–Kettering Cancer Center (New York, NY), received the 2016 Loevinger–Berman Award for his contributions to understanding of the radiobiology of targeted radionuclide therapy. The Loevinger–Berman Award is given annually by the SNMMI Medical Internal Radiation Dose (MIRD) Committee in honor of...
متن کاملMIRD Recognizes Atkins with Loevinger-Berman Award.
H arold L. Atkins, MD, was presented with the LoevingerBerman Award for excellence in the field of internal dosimetry on Sunday, June 15, at the SNM Annual Meeting in New Orleans, LA. The award was established in 1999 by the Medical Internal Radiation Dose (MIRD) Committee in honor of Robert Loevinger and Mones Berman, who formulated the MIRD schema for internal dose calculations. The award is ...
متن کاملAmerican orthodontics Maurice Berman Prize 2005.
This paper describes the orthodontic treatment of two cases, which were awarded the 2005 Maurice Berman Prize.
متن کاملAn O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree
We show that the minmax regret median of a tree can be found in O(n log n) time. This is obtained by a modification of Averbakh and Berman’s O(n log n)-time algorithm: We design a dynamic solution to their bottleneck subproblem of finding the middle of every root-leaf path in a tree.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Śląskie Studia Polonistyczne
سال: 2019
ISSN: 2353-0928
DOI: 10.31261/ssp.2019.13.14